6 research outputs found
Improving bounds on packing densities of 4-point permutations
We consolidate what is currently known about packing densities of 4-point
permutations and in the process improve the lower bounds for the packing
densities of 1324 and 1342. We also provide rigorous upper bounds for the
packing densities of 1324, 1342, and 2413. All our bounds are within
of the true packing densities. Together with the known bounds, this gives us a
fairly complete picture of all 4-point packing densities. We also provide new
upper bounds for several small permutations of length at least five. Our main
tool for the upper bounds is the framework of flag algebras introduced by
Razborov in 2007.Comment: journal style, 18 page
Strong Forms of Stability from Flag Algebra Calculations
Given a hereditary family of admissible graphs and a function
that linearly depends on the statistics of order-
subgraphs in a graph , we consider the extremal problem of determining
, the maximum of over all admissible
graphs of order . We call the problem perfectly -stable for a graph
if there is a constant such that every admissible graph of order
can be made into a blow-up of by changing at most
adjacencies. As special
cases, this property describes all almost extremal graphs of order within
edges and shows that every extremal graph of order is a
blow-up of .
We develop general methods for establishing stability-type results from flag
algebra computations and apply them to concrete examples. In fact, one of our
sufficient conditions for perfect stability is stated in a way that allows
automatic verification by a computer. This gives a unifying way to obtain
computer-assisted proofs of many new results.Comment: 44 pages; incorporates reviewers' suggestion
Combinatorial specifications for juxtapositions of permutation classes
We show that, given a suitable combinatorial specification for a permutation class C, one can obtain a specification for the juxtaposition (on either side) of C with Av(21) or Av(12), and that if the enumeration for C is given by a rational or algebraic generating function, so is the enumeration for the juxtaposition. Furthermore this process can be iterated, thereby providing an effective method to enumerate any "skinny" k×1 grid class in which at most one cell is non-monotone, with a guarantee on the nature of the enumeration given the nature of the enumeration of the non-monotone cell
Juxtaposing Catalan Permutation Classes with Monotone Ones
This paper enumerates all juxtaposition classes of the form "Av(abc) next to Av(xy)", where abc is a permutation of length three and xy is a permutation of length two. We use Dyck paths decorated by sequences of points to represent elements from such a juxtaposition class. Context free grammars are then used to enumerate these decorated Dyck paths
Combinatorial specifications for juxtapositions of permutation classes
We show that, given a suitable combinatorial specification for a permutation class C, one can obtain a specification for the juxtaposition (on either side) of C with Av(21) or Av(12), and that if the enumeration for C is given by a rational or algebraic generating function, so is the enumeration for the juxtaposition. Furthermore this process can be iterated, thereby providing an effective method to enumerate any 'skinny' k x 1 grid class in which at most one cell is non-monotone, with a guarantee on the nature of the enumeration given the nature of the enumeration of the non-monotone cell